Analyzing Infeasible Mixed-Integer and Integer Linear Programs
نویسندگان
چکیده
منابع مشابه
Analyzing Infeasible Mixed-Integer and Integer Linear Programs
Algorithms and computer-based tools for analyzing infeasible linear and nonlinear programs have been developed in recent years, but few such tools exist for infeasible mixed-integer or integer linear programs. One approach that has proven especially useful for infeasible linear programs is the isolation of an Irreducible Infeasible Set of constraints (IIS), a subset of the constraints defining ...
متن کاملPresolving Mixed-Integer Linear Programs
We survey the techniques used for presolving Mixed-integer linear programs (MILPs). Presolving is an important component of all modern MILP solvers. It is used for simplifying a given instance, for detecting any obvious problems or errors, and for identifying structures and characteristics that are useful for solving an instance.
متن کاملInequalities for Mixed Integer Linear Programs
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships between these...
متن کاملValid inequalities for mixed integer linear programs
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships between these...
متن کاملSolving Mixed-Integer Nonlinear Programs using Adaptively Refined Mixed-Integer Linear Programs
We propose a method for solving mixed-integer nonlinear programs (MINLPs) to global optimality by discretization of occuring nonlinearities. The main idea is based on using piecewise linear functions to construct mixed-integer linear program (MIP) relaxations of the underlying MINLP. In order to find a global optimum of the given MINLP we develope an iterative algorithm which solves MIP relaxat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 1999
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.11.1.63